翻訳と辞書 Words near each other ・ Continuous functional calculus ・ Continuous functions on a compact Hausdorff space ・ Continuous game ・ Continuous geometry ・ Continuous graph ・ Continuous group action ・ Continuous gusts ・ Continuous Hahn polynomials ・ Continuous harvest ・ Continuous hyperthermic peritoneal perfusion ・ Continuous ink system ・ Continuous inspection ・ Continuous integrated triage ・ Continuous integration ・ Continuous journey regulation ・ Continuous knapsack problem ・ Continuous linear extension ・ Continuous linear operator ・ Continuous Liquid Interface Production ・ Continuous mandatory ventilation ・ Continuous mapping theorem ・ Continuous marine broadcast ・ Continuous Media Markup Language ・ Continuous Ministry ・ Continuous Ministry (New Zealand) ・ Continuous Ministry (Queensland) ・ Continuous modelling ・ Continuous monitoring ・ Continuous motion pot washing ・ Continuous murmurs Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Continuous knapsack problem ： ウィキペディア英語版 Continuous knapsack problem In theoretical computer science, the continuous knapsack problem (also known as the fractional knapsack problem) is an algorithmic problem in combinatorial optimization in which the goal is to fill a container (the "knapsack") with fractional amounts of different materials chosen to maximize the value of the selected materials.〔.〕〔.〕 It resembles the classic knapsack problem, in which the items to be placed in the container are indivisible; however, the continuous knapsack problem may be solved in polynomial time whereas the classic knapsack problem is NP-hard.〔 It is a classic example of how a seemingly small change in the formulation of a problem can have a large impact on its computational complexity. ==Problem definition== An instance of either the continuous or classic knapsack problems may be specified by the numerical capacity ''W'' of the knapsack, together with a collection of materials, each of which has two numbers associated with it: the weight ''wi'' of material that is available to be selected and the value per unit weight ''vi'' of that material. The goal is to choose an amount ''xi'' ≤ ''wi'' of each material, subject to the capacity constraint :$\backslash sum\_i\; x\_i\backslash le\; W$ and maximizing the total benefit :$\backslash sum\_i\; x\_i\; v\_i$. In the classic knapsack problem, each of the amounts ''xi'' must be either zero or ''wi''; the continuous knapsack problem differs by allowing ''xi'' to range continuously from zero to ''wi''.〔 Some formulations of this problem rescale the variables ''xi'' to be in the range from 0 to 1 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Continuous knapsack problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.